Search in patchy media: Exploitation-exploration tradeoff.

نویسندگان

  • M Chupeau
  • O Bénichou
  • S Redner
چکیده

How to best exploit patchy resources? We introduce a minimal exploitation-migration model that incorporates the coupling between a searcher's trajectory, modeled by a random walk, and ensuing depletion of the environment by the searcher's consumption of resources. The searcher also migrates to a new patch when it takes S consecutive steps without finding resources. We compute the distribution of consumed resources F_{t} at time t for this non-Markovian searcher and show that consumption is maximized by exploring multiple patches. In one dimension, we derive the optimal strategy to maximize F_{t}. This strategy is robust with respect to the distribution of resources within patches and the criterion for leaving the current patch. We also show that F_{t} has an optimum in the ecologically relevant case of two-dimensional patchy environments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Risk and Ambiguity in Information Seeking: Eye Gaze Patterns Reveal Contextual Behavior in Dealing with Uncertainty

Information foraging connects optimal foraging theory in ecology with how humans search for information. The theory suggests that, following an information scent, the information seeker must optimize the tradeoff between exploration by repeated steps in the search space vs. exploitation, using the resources encountered. We conjecture that this tradeoff characterizes how a user deals with uncert...

متن کامل

Optimal Contraction Theorem for Exploration-Exploitation Tradeoff in Search and Optimization

Global optimization process can often be divided into two subprocesses: exploration and exploitation. The tradeoff between exploration and exploitation (T:Er&Ei) is crucial in search and optimization, having a great effect on global optimization performance, e.g., accuracy and convergence speed of optimization algorithms. In this paper, definitions of exploration and exploitation are first give...

متن کامل

Augmented Downhill Simplex a Modified Heuristic Optimization Method

Augmented Downhill Simplex Method (ADSM) is introduced here, that is a heuristic combination of Downhill Simplex Method (DSM) with Random Search algorithm. In fact, DSM is an interpretable nonlinear local optimization method. However, it is a local exploitation algorithm; so, it can be trapped in a local minimum. In contrast, random search is a global exploration, but less efficient. Here, rand...

متن کامل

roving the Learning Efficiencies of ealtime Searc

The capability of learning is one of the salient features of realtime search algorithms such as LRTA*. The major impediment is, however, the instability of the solution quality during convergence: (1) they try to find all optimal solutions even after obtaining fairly good solutions, and (2) they tend to move towards unexplored areas thus failing to balance exploration and exploitation. We propo...

متن کامل

Exploration/Exploitation Tradeoff with cell-shift and Heuristic Crossover for Evolutionary Algorithms

In order to tradeoff exploration/exploitation and inspired by cell genetic algorithm a cellshift crossover operator for evolutionary algorithm (EA) is proposed in this paper. The definition domain is divided into n-dimension cubic sub-domains (cell) and each individual locates at an ndimensional cube. Cell-shift crossover first exchanges the cell numbers of the crossover pair if they are in the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Physical review. E

دوره 95 1-1  شماره 

صفحات  -

تاریخ انتشار 2017